On the Existence of Shadow Prices in Finite Discrete Time

نویسندگان

  • Jan Kallsen
  • Johannes Muhle-Karbe
چکیده

A shadow price is a process S̃ lying within the bid/ask prices S, S of a market with proportional transaction costs, such that maximizing expected utility from consumption in the frictionless market with price process S̃ leads to the same maximal utility as in the original market with transaction costs. For finite Ω, this note provides an elementary proof for the existence of such a shadow price.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Existence of shadow prices in finite probability spaces

A shadow price is a process S̃ lying within the bid/ask prices S, S of a market with proportional transaction costs, such that maximizing expected utility from consumption in the frictionless market with price process S̃ leads to the same maximal utility as in the original market with transaction costs. For finite probability spaces, this note provides an elementary proof for the existence of suc...

متن کامل

Dynamic Pricing with Periodic Review and a Finite set of Prices with Cancellation

In this paper, three dynamic pricing models are developed and analyzed. We assume a limited number of a particular asset is offered for sale over a period of time. This asset is perishable and can be an inventory or a manufacturing capacity. During each period, the seller sets a price for this asset. This price is selected from a predetermined discrete set. The maximum amount which a customer i...

متن کامل

RANKING DMUS ON THE BENCHMARK LINE WITH EQUAL SHADOW PRICES

Data envelopment analysis (DEA) with considering the best condition for each decision making unit (DMU) assesses the relative efficiency for it and divides a homogenous group of DMUs in to two categories: efficient and inefficient, but traditional DEA models can not rank efficient DMUs. Although some models were introduced for ranking efficient DMUs, Franklin Lio & Hsuan peng (2008), proposed a...

متن کامل

A NEW SECRET SHARING SCHEME ADVERSARY FUZZY STRUCTURE BASED ON AUTOMATA

In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible fin...

متن کامل

FINITE-TIME PASSIVITY OF DISCRETE-TIME T-S FUZZY NEURAL NETWORKS WITH TIME-VARYING DELAYS

This paper focuses on the problem of finite-time boundedness and finite-time passivity of discrete-time T-S fuzzy neural networks with time-varying delays. A suitable Lyapunov--Krasovskii functional(LKF) is established to derive sufficient condition for finite-time passivity of discrete-time T-S fuzzy neural networks. The dynamical system is transformed into a T-S fuzzy model with uncertain par...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009